Rank drops of recurrence matrices
نویسندگان
چکیده
منابع مشابه
On higher rank numerical hulls of normal matrices
In this paper, some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated. A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given. Moreover, using the extreme points of the numerical range, the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$, where $A_1...
متن کاملSome rank equalities for finitely many tripotent matrices
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 page...
متن کاملNUMBER OF RANK r SYMMETRIC MATRICES OVER FINITE FIELDS
We determine the number of n×n symmetric matrices over GF (p) that have rank r for 0 ≤ r ≤ n. In [BM2] Brent and McKay determine the number of n × n symmetric matrices over Zp that have determinant zero. Thus they determine the number of n× n symmetric matrices over Zp that have rank n. We extend their result to symmetric matrices over GF (p) and we determine the number of matrices that have ra...
متن کامل5 M ay 2 00 5 Jacobians and rank 1 perturbations relating to unitary Hessenberg matrices
In a recent work Killip and Nenciu gave random recurrences for the characteristic polynomials of certain unitary and real orthogonal upper Hessenberg matrices. The corresponding eigenvalue p.d.f.’s are β-generalizations of the classical groups. Left open was the direct calculation of certain Jacobians. We provide the sought direct calculation. Furthermore, we show how a multiplicative rank 1 pe...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017